Measuring UK crime gangs: a social network problem

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Gangs and social change

Extant literature on the subject has usually defined gangs as loose associations of individuals engaged in some type of delinquent or criminal activity. Yet researchers have failed to sociologically differentiate gangs from other types of collective behavior. In contrast, this article understands gangs as organizations influenced by the social structure of the urban areas in which they operate....

متن کامل

GANGs: Generative Adversarial Network Games

Generative Adversarial Networks (GAN) have become one of the most successful frameworks for unsupervised generative modeling. As GANs are difficult to train much research has focused on this. However, very little of this research has directly exploited gametheoretic techniques.We introduce Generative Adversarial Network Games (GANGs), which explicitly model a finite zero-sum game between a gene...

متن کامل

Node discovery problem for a social network

This paper presents a practical heuristic algorithm to address a node discovery problem. The node discovery problem is to discover a clue on the person, who does not appear in the observed records, but is relevant functionally in affecting decision-making and behavior of an organization. We define two topological relevance of a node in a social network (global and local relevance). Association ...

متن کامل

Crime Detection and Prevention using Social Network Analysis

A society is built of individuals and group of individuals make organization. These individuals or organizations are also called as nodes. A structure that consist these nodes and relation between these nodes is known as social networking. We all are surrounded by networks and plays an important role of individual unit in a network of different kinds of social relationships, biological systems....

متن کامل

Modeling of Partial Digest Problem as a Network flows problem

Restriction Site Mapping is one of the interesting tasks in Computational Biology. A DNA strand can be thought of as a string on the letters A, T, C, and G. When a particular restriction enzyme is added to a DNA solution, the DNA is cut at particular restriction sites. The goal of the restriction site mapping is to determine the location of every site for a given enzyme. In partial digest metho...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Social Network Analysis and Mining

سال: 2015

ISSN: 1869-5450,1869-5469

DOI: 10.1007/s13278-015-0265-1